A Denotational Semantics for Low-Level Probabilistic Programs with Nondeterminism

Denotational Semantics for Probabilistic Refusal Testing

In this paper, refusal testing ideas are applied to deene a testing semantics for a probabilistic process algebra. A testing equivalence is deened by combining the greater discriminatory power of refusal testing and a simple treatment of the prob-abilistic component of processes. This testing equivalence is characterized by two fully abstract denotational semantics. The rst of them is based on ...

Denotational Semantics for a Probabilistic Timed Shared-Variable Language

Operational and Denotational Semantics of Rewrite Programs

In this paper we present a new operational and denotational semantics for rewrite systems as logic programs. The main feature of our rewrite programs is that they allow us to define predicates not only by implications as in Prolog, but also by equivalences. We give a few examples showing how rewrite programs may turn out to be more effective than Prolog programs in capturing the user’s intended...

Denotational Semantics for "Natural" Language Question-Answering Programs

Scott-Strachey style denotational semantics is proposed as a suitable means of communicating the specification of "natural" language question answerers to computer programmers and software engineers. The method is exemplified by a simple question answerer communicating with a small data base. This example is partly based on treatment of fragments of English by Montague. Emphasis is placed on th...

A Denotational Semantics for Circus

Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP. Previously, a denotational semantics has been given to Circus; however, as a shallow embedding of Circus in Z, it was not possible to use it to prove properties like the refinement laws that justify the distinguishing development technique associated with Circus. This work presents a fina...